A Modified KZ Reduction Algorithm

The Korkine-Zolotareff (KZ) reduction has been used in communications and cryptography. In this paper, we modify a very recent KZ reduction algorithm proposed by Zhang et al., resulting in a new algorithm, which can be much faster and more numerically reliable, especially when the basis matrix is ill conditioned.Comment: has been accepted by IEEE ISIT 201

A Linearithmic Time Algorithm for a Shortest Vector Problem in Compute-and-Forward Design

We propose an algorithm with expected complexity of \bigO(n\log n) arithmetic operations to solve a special shortest vector problem arising in computer-and-forward design, where $n$ is the dimension of the channel vector. This algorithm is more efficient than the best known algorithms with proved complexity.Comment: It has been submitted to ISIT 201